A Similarity Search Using Molecular Topological Graphs

نویسندگان

  • Yoshifumi Fukunishi
  • Haruki Nakamura
چکیده

A molecular similarity measure has been developed using molecular topological graphs and atomic partial charges. Two kinds of topological graphs were used. One is the ordinary adjacency matrix and the other is a matrix which represents the minimum path length between two atoms of the molecule. The ordinary adjacency matrix is suitable to compare the local structures of molecules such as functional groups, and the other matrix is suitable to compare the global structures of molecules. The combination of these two matrices gave a similarity measure. This method was applied to in silico drug screening, and the results showed that it was effective as a similarity measure.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Turbo similarity searching: Effect of fingerprint and dataset on virtual-screening performance

Turbo similarity searching uses information about the nearest neighbours in a conventional chemical similarity search to increase the effectiveness of virtual screening, with a data fusion approach being used to combine the nearest-neighbour information. A previous paper suggested that the approach was highly effective in operation; this paper further tests the approach using a range of differe...

متن کامل

Cyclic Graphs with Degenerate Sequences: a Study of Similarity*

Rev. Roum. Chim. (submitted). Abstract Similarity of two sets of cycle-containing molecular graphs: spiro-alkanes and full Hamiltonian detour cubic cages, is discussed in terms of interand intra-molecular similarity. Molecular description is given as sequences of some well known topological sequences: Distance Degree Sequence DDS, Detour Degree Sequence ∆DS, All Path Sequence APS, Shortest Path...

متن کامل

Eccentric Connectivity Index of Some Dendrimer Graphs

The eccentricity connectivity index of a molecular graph G is defined as (G) = aV(G) deg(a)ε(a), where ε(a) is defined as the length of a maximal path connecting a to other vertices of G and deg(a) is degree of vertex a. Here, we compute this topological index for some infinite classes of dendrimer graphs.

متن کامل

Subgraph Similarity Search in Large Graphs

One of the major challenges in applications related to social networks, computational biology, collaboration networks etc., is to efficiently search for similar patterns in their underlying graphs. These graphs are typically noisy and contain thousands of vertices and millions of edges. In many cases, the graphs are unlabeled and the notion of similarity is also not well defined. We study the p...

متن کامل

Automatic Cel Painting in Computer-assisted Cartoon Production using Similarity Recognition

The task of painting each cel of an animated sequence has always been a tedious work using traditional methods. In order to simplify and speed up the process, the development of an automatic cel painting system is desired. This paper presents a method for assisting the production of cartoon animation using computers in order to reduce the production expense and to improve the overall quality. I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 2009  شماره 

صفحات  -

تاریخ انتشار 2009